Fires on trees
نویسندگان
چکیده
منابع مشابه
Periglacial fires and trees in a continental setting of Central Canada, Upper Pleistocene.
Fire is a key factor controlling global vegetation patterns and carbon cycling. It mostly occurs under warm periods during which fuel builds up with sufficient moisture, whereas such conditions stimulate fire ignition and spread. Biomass burning increased globally with warming periods since the last glacial era. Data confirming periglacial fires during glacial periods are very sparse because su...
متن کاملEffects of Prescribed Fires on Young Valley Oak Trees at a Research Restoration Site in the Central Valley of California
Woodland restoration sites planted with Quercus lobata (valley oak) often have serious invasions of nonnative annual grasses and thistles. Although prescribed fire can effectively control these exotics, restoration managers may be reluctant to use fire if it causes substantial mortality of recently planted saplings. We studied the effects of prescribed fires on the survival and subsequent growt...
متن کاملThe Fires
Qualitative and semi-quantitative analyses presented in this article suggest that the massive fires caused by the crash of the planes into the World Trade Center Towers and the spillage of large amounts of jet fuel inside the buildings played a major role in their quick collapse on September 11, 2001. It is argued that the WTC fires, while unprecedented in form, magnitude and extent, resembled ...
متن کاملA NOTE ON THE EQUISEPARABLE TREES
Let T be a tree and n_{l}(eIT) and n_{2}(eIT) denote the number of vertices of T, lying on the two sides of the edge e. Suppose T_{l} and T_{2} are two trees with equal number of vertices, e in T_{1} and f in T_{2}. The edges e and f are said to be equiseparable if either n_{l}(eIT_{I}) = n_{l}(fIT_{2}) or n_{l}(eIT_{I}) = n_{2}(fIT_{2}). If there is an one-to-one correspondence between the ver...
متن کاملOn Hop Roman Domination in Trees
Let $G=(V,E)$ be a graph. A subset $Ssubset V$ is a hop dominating setif every vertex outside $S$ is at distance two from a vertex of$S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$. Theconnected hop domination number of $G$, $ gamma_{ch}(G)$, is the minimum cardinality of a connected hopdominating set of $G$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2012
ISSN: 0246-0203
DOI: 10.1214/11-aihp435